Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
541	Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Mathematics Scheduling Job shop scheduling Mathematical sciences Theoretical computer science Bin packing problem Algorithm Shifting bottleneck heuristic David Shmoys Operations research Applied mathematics Mathematical optimization
542	Vehicle Routing and Job Shop Scheduling: What’s the difference?∗ J. Christopher Beck Patrick Prosser and Evgeny Selensky Cork Constraint Computation Center Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-01-18 12:07:28 Theoretical computer science Vehicle routing problem Job shop scheduling Scheduling Linear programming Guided Local Search Constraint satisfaction Optimization problem Mathematical optimization Operations research Applied mathematics Mathematics
543	CEED Seminar ProceedingsFletcher: Network Topology Optimisation Network Topology Optimisation James Fletcher Add to Reading List Source URL: www.ceed.uwa.edu.au Language: English - Date: 2015-03-17 22:48:02 Applied mathematics Operations research Travelling salesman problem Spanning tree Network topology Genetic algorithm Topology Routing Minimum spanning tree Theoretical computer science Mathematics Mathematical optimization
544	Evaluating Resilience Strategies Based on an Evolutionary Multi-agent System Kazuhiro Minami, Tomoya Tanjo, and Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, hm2}@ism.ac.jp Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2013-10-28 05:43:11 Artificial intelligence Multi-agent systems Mathematical optimization Agent-based model Constraint satisfaction problem Genetic algorithm Psychological resilience Computing Constraint programming Complex systems theory Science
545	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
546	Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science
547	Scheduling Sport Tournaments using Constraint Logic Programming Andrea Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:14 Applied mathematics Mathematical optimization Combinatorial optimization Complexity classes Constraint logic programming Logic programming Constraint Matching Assignment problem Theoretical computer science Constraint programming Computational complexity theory
548	A maximisation problem Advanced Algorithms – COMS31900Lecture 14 Linear programming Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Operations research Duality Numerical software PROPT Mathematical optimization Convex optimization Linear programming
549	Oblivious and Non-Oblivious Local Search for Combinatorial Optimization by Justin Ward Add to Reading List Source URL: tspace.library.utoronto.ca Language: English - Date: 2013-01-07 16:15:02 Computational complexity theory Operations research Mathematical optimization Greedy algorithm Matroid theory Submodular set function Combinatorial optimization Optimization problem Algorithm Theoretical computer science Mathematics Applied mathematics
550	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE